Abstract Template for LabPhon2012
نویسنده
چکیده
A widely-cited study investigating effects of recognition difficulty on the phonetic realization of words (Wright, 1997, 2004) described vowel dispersion in a subset of the Easy/Hard database (Torretta, 1995). The core finding was that vowel dispersion, i.e. distance from the center of the talker’s F1/F2 space, was greater in words that represent difficult recognition targets, due to competition from other words in the lexicon (‘hard’ words) than in easy recognition targets (‘easy’ words). The goal of the current study was to test whether the pattern observed in the subset extended to a larger portion of the Easy/Hard database, and whether the effect persisted when controlling for known other determinants of vowel dispersion. Extending the investigation to all monophthongs in the database, we find that recognition difficulty fails to have a significant effect on dispersion when effects of segmental context are brought under statistical control. We conclude that the pattern of dispersion in Wright (1997) is not due to lexical competition, but is most likely due to segmental context, particularly place of articulation of consonants preceding and following the target vowels. We discuss the implications of this reanalysis for studies of pronunciation variation.
منابع مشابه
Polynomial Template Generation using Sum-of-Squares Programming
Template abstract domains allow to express more interesting properties than classical abstract domains. However, template generation is a challenging problem when one uses template abstract domains for program analysis. In this paper, we relate template generation with the program properties that we want to prove. We focus on one-loop programs with nested conditional branches. We formally defin...
متن کاملUsing Template Haskell for Abstract Interpretation
Metaprogramming consists of writing programs that generate or manipulate other programs. Template Haskell is a recent extension of Haskell, currently implemented in the Glasgow Haskell Compiler, giving support to metaprogramming at compile time. Our aim is to apply these facilities in order to statically analyse programs and transform them at compile time. In this paper we use Template Haskell ...
متن کاملTowards a Text Generation Template Language for Modelica
The uses, needs, and requirements of a text generation template language for Modelica are discussed. A template language may allow more concise and readable programming of the generation of textual models, program code, or documents, from a structured model representation such as abstract syntax trees (AST). Applications can be found in generating simulation code in other programming languages ...
متن کاملTemplate-Based Unbounded Time Verification of Affine Hybrid Automata
Computing over-approximations of all possible time trajectories is an important task in the analysis of hybrid systems. Sankaranarayanan et al. [20] suggested to approximate the set of reachable states using template polyhedra. In the present paper, we use a max-strategy improvement algorithm for computing an abstract semantics for affine hybrid automata that is based on template polyhedra and ...
متن کاملCan Wavelet Denoising Improve Motor Unit Potential Template Estimation?
Background: Electromyographic (EMG) signals obtained from a contracted muscle contain valuable information on its activity and health status. Much of this information lies in motor unit potentials (MUPs) of its motor units (MUs), collected during the muscle contraction. Hence, accurate estimation of a MUP template for each MU is crucial. Objective: To investigate the possibility of improv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013